Cubic vertex-transitive graphs of girth six

نویسندگان

چکیده

In this paper, a complete classification of finite simple cubic vertex-transitive graphs girth 6 is obtained. It proved that every such graph, with the exception Desargues graph on 20 vertices, either skeleton hexagonal tiling torus, truncation an arc-transitive triangulation closed hyperbolic surface, or 6-regular respect to dihedral scheme. Cubic larger than are also discussed.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semiregular Automorphisms of Cubic Vertex Transitive Graphs

It is shown that for a connected cubic graph Γ , a vertex transitive group G ≤ AutΓ contains a large semiregular subgroup. This confirms a conjecture of Cameron and Sheehan (2001).

متن کامل

Semiregular Automorphisms of Cubic Vertex-transitive Graphs

We characterise connected cubic graphs admitting a vertextransitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a semiregular subgroup of maximum order in a vertex-transitive group of automorphisms of a connected cubic graph grows with the order of the graph, settling [2, Problem ...

متن کامل

Semiregular automorphisms of vertex-transitive cubic graphs

An old conjecture of Marušič, Jordan and Klin asserts that any finite vertextransitive graph has a non-trivial semiregular automorphism. Marušič and Scapellato proved this for cubic graphs. For these graphs, we make a stronger conjecture, to the effect that there is a semiregular automorphism of order tending to infinity with n. We prove that there is one of order greater than 2.

متن کامل

Girth six cubic graphs have Petersen minors

We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph. 3 January 1997 Revised 17 March 2014 ∗ Research partially performed under a consulting agreement with Bellcore, and partially supported by DIMACS Center, Rutgers University, New Brunswick, New Jersey 08903, USA. 1 Partially supported by NSF under Grant No...

متن کامل

Efficient domination in cubic vertex-transitive graphs

An independent set of vertices S of a graph dominates the graph efficiently if every vertex of the graph is either in S or has precisely one neighbour in S. In this paper we prove that a connected cubic vertex-transitive graph on a power of 2 vertices has a set that dominates it efficiently if and only if it is not isomorphic to a Möbius ladder. This is a preprint of an article accepted for pub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2022

ISSN: ['1872-681X', '0012-365X']

DOI: https://doi.org/10.1016/j.disc.2021.112734